منابع مشابه
Organizing Volumes of Right-angled Hyperbolic Polyhedra
This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the combinatorics of such a polyhedron, while keeping it within the class of right-angled objects, until it is a disjoint union of Löbell polyhedra, a class of poly...
متن کاملOn Skeletons, Diameters and Volumes of Metric Polyhedra
Abst rac t . We survey and present new geometric and combinatorial propertiez of some polyhedra with application in combinatorial optimization, for example, the max-cut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relm :ons and connectivity of the metric polytope and its relatives. In partic~da...
متن کاملComputing swept volumes
The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object (given in a typical boundary representation) to be swept through an arbitrary trajectory. A polyhed...
متن کاملComputing Covering Polyhedra of Non-Convex Objects
We present an algorithm to build covering polyhedra for digital 3D objects, by iteratively filling local concavities. The resulting covering polyhedron is convex and is a good approximation of the convex hull of the object. The algorithm uses 3 x 3 x 3 operators and requires a few minutes for a 128 x 128 x 128 image, when implemented on a sequential computer. Once the covering polyhedron has be...
متن کاملComputing the Extreme Points of Tropical Polyhedra
We present an efficient algorithm to compute all the extreme elements of a max-plus or tropical polyhedron. This algorithm relies on a combinatorial characterization of these extreme elements, when the polyhedron is defined by inequalities. We show that checking the extremality of an element of such a polyhedron reduces to computing the least model of a compact Horn formula, the latter being a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1986
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1986-0815838-7